منابع مشابه
Combinatorial derivation of the recurrence relation for fibonomial coefficients
Combinatorial interpretation of the fibonomial coefficients recently proposed by the present author [1,2] here results in combinatorial derivation of the recurrence relation for fibonomial coefficients . The presentation is provided with quite an exhaustive context with reference to classical attitude of [3,4]. This note apart from plane grid coordinate system used is fitted with several figure...
متن کاملA Combinatorial Derivation of the PASEP Stationary State
We give a combinatorial derivation and interpretation of the algebra associated with the stationary distribution of the partially asymmetric exclusion process. Our derivation works by constructing a larger Markov chain on a larger set of generalised configurations. A bijection on this new set of configurations allows us to find the stationary distribution of the new chain. We then show that a s...
متن کاملA note on the combinatorial derivation of nonsmall sets
Given an infinite group G and a subset A of G we let ∆(A) = {g ∈ G : |gA ∩ A| = ∞} (this is sometimes called the combinatorial derivation of A). A subset A of G is called: large if there exists a finite subset F of G such that FA = G; ∆-large if ∆(A) is large and small if for every large subset L of G, (G \ A) ∩ L is large. In this note we show that every nonsmall set is ∆-large, answering a qu...
متن کاملOn the superstability of a special derivation
The aim of this paper is to show that under some mild conditions a functional equation of multiplicative $(alpha,beta)$-derivation is superstable on standard operator algebras. Furthermore, we prove that this generalized derivation can be a continuous and an inner $(alpha,beta)$-derivation.
متن کاملA combinatorial derivation of the Poincare' polynomials of the finite irreducible Coxeter groups
(1) The Poincar e polynomials of the nite irreducible Coxeter groups and the Poincar e series of the aane Coxeter groups on three generators are derived by an elementary combinatorial method avoiding the use of Lie theory and invariant theory. (2) Non-recursive methods for the computation of`standard reduced words' for (signed) permutations are described. The algebraic basis for both (1) and (2...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied General Topology
سال: 2013
ISSN: 1989-4147,1576-9402
DOI: 10.4995/agt.2013.1587